Adaptive wavelet methods for saddle point problems
نویسندگان
چکیده
منابع مشابه
Adaptive wavelet methods for saddle point problems
Recently, adaptive wavelet stratégies for symmetrie, positive definite operators have been introduced that were proven to converge. This paper is devoted to the generalization to saddle point problems which are also symmetrie, but indefinite. Firstly, we investigate a posteriori error estimâtes and generalize the known adaptive wavelet strategy to saddle point problems. The convergence of this ...
متن کاملAdaptive Wavelet Methods for Saddle Point Problems - Optimal Convergence Rates
In this paper an adaptive wavelet scheme for saddle point problems is developed and analysed. Under the assumption that the underlying continuous problem satisfies the inf-sup condition it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity. This means that within a certain range the convergence rate which relates the achieved accuracy to t...
متن کاملAdaptive Wavelet Methods for Saddle
Recently, adaptive wavelet strategies for symmetric, positive definite operators have been introduced that were proven to converge. This paper is devoted to the generalization to saddle point problems which are also symmetric, but indeenite. Firstly, we derive explicit criteria for adaptively reened wavelet spaces in order to fullll the Ladyshenskaja{Babu ska{Brezzi (LBB) condition and to be fu...
متن کاملAdaptive Primal-dual Hybrid Gradient Methods for Saddle-point Problems
The Primal-Dual hybrid gradient (PDHG) method is a powerful optimization scheme that breaks complex problems into simple sub-steps. Unfortunately, PDHG methods require the user to choose stepsize parameters, and the speed of convergence is highly sensitive to this choice. We introduce new adaptive PDHG schemes that automatically tune the stepsize parameters for fast convergence without user inp...
متن کاملProbing Methods for Generalized Saddle-Point Problems
Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2000
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an:2000113